Exact real arithmetic using centred intervals and bounded error terms
نویسنده
چکیده
Approximations based on dyadic centred intervals are investigated as a means for implementing exact real arithmetic. It is shown that the field operations can be implemented on these approximations with optimal or near optimal results. Bounds for the loss in quality of approximations for each of the field operations are also given. These approximations can be used as a more efficient alternative to endpoint based implementations of interval analysis. © 2005 Elsevier Inc. All rights reserved.
منابع مشابه
An Extension to Imprecise Data Envelopment Analysis
The standard data envelopment analysis (DEA) method assumes that the values for inputs and outputs are exact. While DEA assumes exact data, the existing imprecise DEA (IDEA) assumes that the values for some inputs and outputs are only known to lie within bounded intervals, and other data are known only up to an order. In many real applications of DEA, there are cases in which some of the input ...
متن کاملUp-to-date Interval Arithmetic: From Closed Intervals to Connected Sets of Real Numbers
This paper unifies the representations of different kinds of computer arithmetic. It is motivated by ideas developed in the book The End of Error by John Gustafson [5]. Here interval arithmetic just deals with connected sets of real numbers. These can be closed, open, half-open, bounded or unbounded. The first chapter gives a brief informal review of computer arithmetic from early floating-poin...
متن کاملSet Membership Parameter Identification with Complex Intervals Using Polar Forms
This paper is dedicated to bounded error identification with complex valued non-linear models. Complex intervals are characterized by using polar forms and a new inclusion function is given for the addition of sectors. The latter is expressed as an optimization problem solved analytically. The new complex interval arithmetic is used with actual data and a complex valued non-linear model for the...
متن کاملEfficient Probabilistic Model Checking of Systems with Ranged Probabilities
We introduce a new technique to model check reachability properties on Interval Discrete-Time Markov Chains (IDTMC). We compute a sound overapproximation of the probabilities of satisfying a given property where the accuracy is characterized in terms of error bounds. We leverage affine arithmetic to propagate the first-order error terms. Higher-order error terms are bounded using interval arith...
متن کاملComplete Interval Arithmetic and Its Implementation on the Computer
Let IIR be the set of closed and bounded intervals of real numbers. Arithmetic in IIR can be defined via the power set IPIR (the set of all subsets) of real numbers. If in case of division zero is not contained in the divisor arithmetic in IIR is an algebraically closed subset of the arithmetic in IPIR. Arithmetic in IPIR allows division by an interval that contains zero also. This results in c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Algebr. Program.
دوره 66 شماره
صفحات -
تاریخ انتشار 2006